#include <iostream>
#include <vector>
#include <queue>

using namespace std;

// Q1. 最小相邻交换至奇偶交替
// https://leetcode.cn/contest/biweekly-contest-159/problems/minimum-adjacent-swaps-to-alternate-parity/description/

class Solution {
public:
    int minSwaps(vector<int>& nums) {
        queue<int> oddIndex;
        queue<int> evenIndex;
        for (int i = 0; i < nums.size(); i++){
            if(nums[i] % 2 == 0){
                evenIndex.push(i);
            }else{
                oddIndex.push(i);
            }
        }
        if(abs((int)evenIndex.size() - (int)oddIndex.size()) > 1){
            return -1;
        }
        for(int i =)
    }
};

int main()
{
    return 0;
}